MINIMIZING THE MAKESPAN FOR UNRELATED PARALLEL MACHINES
نویسندگان
چکیده
منابع مشابه
Minimizing the makespan for Unrelated Parallel Machines
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results than the traditional SA and developed an effective heuristic for the problem: Squeaky Wheel Optimiz...
متن کاملMinimizing Makespan on Identical Parallel Machines
A heuristic algorithm that uses iteratively LPT and MF approaches on different job and machine sets constructed by using the current solution is developed to solve a classical multiprocessor scheduling problem with the objective of minimizing the makespan. Computational results indicate that the proposed algorithm is very competitive with respect to well-known constructive algorithms for a larg...
متن کاملA new algorithm for minimizing makespan on identical parallel machines
A heuristic algorithm is developed for the classical multiprocessor scheduling problem in which independent jobs are nonpreemptively scheduled on identical parallel machines with the objective of minimizing the makespan. The algorithm uses iteratively the LPT procedure followed by the MultiFit procedure on different job and machine sets. The effectiveness of our algorithm is evaluated through c...
متن کاملMinimizing makespan with release times on identical parallel batching machines
We consider the problem of scheduling n jobs onm identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B (B < n ) jobs as a batch simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. The objective is to minimize the maximum completion time (makespan). ...
متن کاملFlexible flowshop scheduling with equal number of unrelated parallel machines
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Artificial Intelligence Tools
سال: 2007
ISSN: 0218-2130,1793-6349
DOI: 10.1142/s0218213007003175